A process for predicting manhole events in Manhattan.
Abstract We present a knowledge discovery and data mining process developed as part of the Columbia/Con Edison project on manhole event prediction. This process can assist with real-world prioritization problems that involve raw data in the form of noisy documents requiring significant amounts of pre-processing. The documents are linked to a set of instances to be ranked according to prediction criteria. In the case of manhole event prediction, which is a new application for machine learning, the goal is to rank the electrical grid structures in Manhattan (manholes and service boxes) according to their vulnerability to serious manhole
TagLearner A P2P Classifier Learning System from Collaboratively Tagged Text Documents.

Ranking Electrical Feeders of the New York Power Grid.

Measuring Diversity in Regression Ensembles.

Distributed Linear Programming and Resource Management for Data Mining in Distributed Environments.

Distributed Optimization Strategies for Mining on Peer%2Dto%2DPeer Networks.

Orthogonal Decision Trees.
This paper introduces orthogonal decision trees that offer an effective way to construct a redundancy-free, accurate, and meaningful representation of large decision-treeensembles often created by popular techniques such as Bagging, Boosting, Random Forests and many distributed and data stream mining algorithms. Orthogonal decision trees are functionally orthogonal to each other and they correspond to the principal components of the underlying function space. This paper offers a technique to construct such trees based on eigen-analysis of the ensemble and offers experimental results to document the performance of orthogonal trees on grounds of accuracy and model complexity. 1.
Distributed Top%2DK Outlier Detection from Astronomy Catalogs using the DEMAC System.

Orthogonal Decision Trees.
This paper introduces orthogonal decision trees that offer an effective way to construct a redundancy-free, accurate, and meaningful representation of large decision-treeensembles often created by popular techniques such as Bagging, Boosting, Random Forests and many distributed and data stream mining algorithms. Orthogonal decision trees are functionally orthogonal to each other and they correspond to the principal components of the underlying function space. This paper offers a technique to construct such trees based on eigen-analysis of the ensemble and offers experimental results to document the performance of orthogonal trees on grounds of accuracy and model complexity. 1.
Orthogonal Decision Trees for Resource%2DConstrained Physiological Data Stream Monitoring Using Mobile Devices.
Several challenging new applications demand the ability to do data mining on resource constrained devices. One such application is that of monitoring physiological data streams obtained from wearable sensing devices. Such monitoring has applications for pervasive healthcare management, be it for seniors, emergency response personnel, soldiers in the battlefield or athletes. A key requirement is that the monitoring system be able to run on resource constrained handheld or wearable devices. Orthogonal decision trees (ODTs) offer an effective way to construct a redundancy-free, accurate, and meaningful representation of large decision-tree-ensembles often created by popular techniques such as Bagging, Boosting, Random Forests and many distributed and data stream mining algorithms. Orthogonal decision trees are functionally orthogonal to each other and they correspond to the principal components of the underlying function space. This paper discusses various properties of the ODTs and their suitability for monitoring physiological data streams in a resource-constrained environment. It offers experimental results to document the performance of orthogonal trees on grounds of accuracy, model complexity, and other characteristics in a resource-constrained mobile environment. 1.
Orthogonal Decision Trees.
This paper introduces orthogonal decision trees that offer an effective way to construct a redundancy-free, accurate, and meaningful representation of large decision-treeensembles often created by popular techniques such as Bagging, Boosting, Random Forests and many distributed and data stream mining algorithms. Orthogonal decision trees are functionally orthogonal to each other and they correspond to the principal components of the underlying function space. This paper offers a technique to construct such trees based on eigen-analysis of the ensemble and offers experimental results to document the performance of orthogonal trees on grounds of accuracy and model complexity. 1.
Analysis of privacy preserving random perturbation techniques further explorations.
Privacy is becoming an increasingly important issue in many data mining applications, particularly in the security and defense area. This has triggered the development of many privacy-preserving data mining techniques. A large fraction of them uses randomized data distortion techniques to mask the data for preserving the privacy. They attempt to hide the sensitive data by randomly modifying the data values using additive noise. This paper questions the utility of such randomized data distortion technique for preserving privacy in many cases and urges caution.It notes that random objects (particularly random matrices) have “predictable” structures in the spectral domain and then offers a random matrix-based spectral filtering technique to retrieve original data from the data-set distorted by adding random values. It extends our earlier work questioning the efficacy of random perturbation techniques using additive noise for privacy-preserving data mining in continuous valued domain and presents new results in the discrete domain. It shows that the growing collection of random perturbation-based “privacy-preserving ” data mining techniques may need a careful scrutiny in order to prevent privacy breaches through linear transformations. The paper also presents extensive experimental results in order to support this claim. This is an extension of the paper “Random Data Perturbation
Fast and effective characterization of 3D region data.
We consider the problem of characterization of spatial region data such as the regions of interest (ROIs) in medical images. We propose a method that efficiently extracts a k-dimensional feature vector using concentric spheres in 3D (or circles in 2D) radiating out of the ROI’s center of mass. The proposed method can be applied to classification and similarity searches of ROIs. We also propose a region data growth model that we use to generate artificial data with various properties including homogeneous and non-homogeneous region data. We use the artificial data to evaluate the effectiveness of the characterization method comparing also its classification performance to mathematical morphology. The experiments show that the performance of our method is comparable or better than that of mathematical morphology although it is two orders of magnitude faster which makes it very suitable for application in very large image databases. 1.
